منابع مشابه
An algebraic approach to Halls matching theorem abridged version
The purpose of this note is to present a proof of Hall's matching theorem (also called marriage theorem) which I have not encountered elsewhere in literature-what yet does not mean that it is necessarily new. We refer to Hall's theorem in the following form: Theorem 1 (Hall). Let n be a positive integer. Let be a bipartite graph whose set of vertices consists of n blue vertices B 1 ; B 2 Some n...
متن کاملAn algebraic approach to Halls matching theorem
The purpose of this note is to present a proof of Hall's matching theorem (also called marriage theorem) which I have not encountered elsewhere in literature-what yet does not mean that it is necessarily new. We refer to Hall's theorem in the following form: Theorem 1 (Hall). Let n be a positive integer. Let be a bipartite graph whose set of vertices consists of n blue vertices B 1 ; B 2 Some n...
متن کاملTowards an Effective Version of a Theorem of Stafford
Simplifying a matrix of differential operators by elementary row and column operations is quite a fundamental task. If one considers matrices whose entries are ordinary timevarying differential operators with rational function coefficients (or more generally meromorphic functions) then a classical theorem tells you that by elementary row and column operations an analogue to the Smith form can b...
متن کاملAn Effective Version of Kronecker’s Theorem on Simultaneous Diophantine Approximation
Kronecker’s theorem states that if 1, θ1, . . . , θn are real algebraic numbers, linearly independent over Q, and if α ∈ R, then for any > 0 there are q ∈ Z and p ∈ Z such that |qθi − αi − pi| < . Here, a bound on q is given in terms of the dimension n, of the precision , of the degree of the θi’s and of their height. A possible connection to the square-root sum problem is discussed.
متن کاملAn effective version of Wilkie's theorem of the complement and some effective o-minimality results
Wilkie (1999) proved a “theorem of the complement” which implies that in order to establish the o-minimality of an expansion of R with C∞ functions it suffices to obtain uniform (in the parameters) bounds on the number of connected components of quantifier free definable sets. He deduced that any expansion of R with a family of Pfaffian functions is o-minimal. We prove an effective version of W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1983
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1983-0691291-0